Intersection of Ellipsoids
نویسنده
چکیده
منابع مشابه
LMI Approximations for the Radius of the Intersection of Ellipsoids
This paper addresses the problem of evaluating the maximum norm vector within the intersection of several ellipsoids. This diicult non-convex optimization problem frequently arises in robust control synthesis. Linear matrix inequality relaxations of the problem are enumerated. Two randomized algorithms and several ellipsoidal approximations are described. Guaranteed approximation bounds are der...
متن کاملGaussian Correlation Conjecture for Symmetric Convex Sets
Gaussian correlation conjecture states that the Gaussian measure of the intersection of two symmetric convex sets is greater or equal to the product of the measures. In this paper, firstly we prove that the inequality holds when one of the two convex sets is the intersection of finite centered ellipsoids and the other one is simply symmetric. Then we prove that any symmetric convex set can be a...
متن کاملDistance of closest approach of two arbitrary hard ellipsoids.
The distance of closest approach of particles with hard cores is a key parameter in statistical theories and computer simulations of liquid crystals and colloidal systems. In this Brief Report, we provide an algorithm to calculate the distance of closest approach of two ellipsoids of arbitrary shape and orientation. This algorithm is based on our previous analytic result for the distance of clo...
متن کاملAn ellipsoidal calculus based on propagation and fusion
Presents an ellipsoidal calculus based solely on two basic operations: propagation and fusion. Propagation refers to the problem of obtaining an ellipsoid that must satisfy an affine relation with another ellipsoid, and fusion to that of computing the ellipsoid that tightly bounds the intersection of two given ellipsoids. These two operations supersede the Minkowski sum and difference, affine t...
متن کاملStabilization of constrained linear systems via smoothed truncated ellipsoids
Polyhedral Lyapunov functions are convenient to solve the constrained stabilization problem of linear systems as non-conservative estimates of the domain of attraction can be obtained. Alternatively, truncated ellipsoids can be used to find an under-estimate of the feasible region, with a considerably reduced number of parameters. This paper reformulates classic geometric intersection operators...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015